User interface that facilitates node pinning for a proactive monitoring tree

ABSTRACT

In some embodiments, in response to the user selecting a first node in the tree to be pinned, the system displays a first detail panel for the first node, wherein the first detail panel displays state information for the first node, wherein the state information is frozen at the time of pinning. Moreover, in response to the user selecting a second node in the tree to be pinned, the system displays a second detail panel for the second node, wherein the second detail panel displays state information for the second node, wherein the state information is frozen at the time of pinning. Note that the first detail panel is displayed concurrently with the second detail panel to facilitate comparing state information between the first and second nodes.

RELATED APPLICATIONS

This application is a continuation of, and hereby claims priority under35 U.S.C. §120 to, pending U.S. patent application Ser. No. 14/609,080filed on 29 Jan. 2015, which is itself a continuation of: issued U.S.patent application Ser. No. 14/253,697 filed on 15 Apr. 2014, which isitself a continuation-in-part of: pending U.S. patent application Ser.No. 14/167,316 filed on 29 Jan. 2014; issued U.S. patent applicationSer. No. 13/874,423 filed 30 Apr. 2013; issued U.S. patent applicationSer. No. 13/874,434 filed 30 Apr. 2013; issued U.S. patent applicationSer. No. 13/874,441 filed 30 Apr. 2013; and pending U.S. patentapplication Ser. No. 13/874,448 filed 30 Apr. 2013. This applicationfurther claims benefit under 35 U.S.C. §119 to U.S. ProvisionalApplication No. 61/883,869 filed 27 Sep. 2013, U.S. ProvisionalApplication No. 61/900,700 filed 6 Nov. 2013, and U.S. ProvisionalApplication No. 61/979,484 filed 14 Apr. 2014. The above-listedapplications are hereby incorporated by reference herein.

This application is also related to pending U.S. patent application Ser.No. not yet assigned, filed Apr. 15, 2014, entitled “ProactiveMonitoring Tree with Severity State Sorting” by inventors TristanFletcher and Cary Noel; pending U.S. patent application Ser. No. not yetassigned, filed Apr. 15, 2014, entitled “Proactive Monitoring Tree withState Distribution Ring” by inventors Tristan Fletcher and Cary Noel;and pending U.S. patent application Ser. No. not yet assigned, filedApr. 15, 2014, entitled “Proactive Monitoring Tree ProvidingDistribution Stream Chart with Branch Overlay” by inventors TristanFletcher and Cary Noel.

RELATED ART

The disclosed embodiments generally relate to techniques for monitoringand analyzing performance in a computer system. More specifically, thedisclosed embodiments relate to the design of a performance-monitoringsystem that provides a user interface with a proactive monitoring treethat facilitates visualizing performance information for virtualmachines and associated host systems in a hierarchically structuredcomputing environment.

BACKGROUND

Organizations are increasingly relying on cloud-based computing systemsto perform large-scale computational tasks. Such cloud-based computingsystems are typically operated by hosting companies that maintain asizable computational infrastructure, often comprising thousands ofservers sited in geographically distributed data centers. Customerstypically buy or lease computational resources from these hostingcompanies. The hosting companies in turn provision computationalresources according to the customer's requirements and then enable thecustomers to access these resources.

In many cases, cloud-based computing systems provide a virtualizedcomputing environment, wherein tasks run on “virtual machines” thatexecute on underlying physical host systems. Such virtualized computingenvironments enable computational tasks to be easily moved among hostsystems to facilitate load balancing and fault tolerance. However, theyalso complicate the process of diagnosing and resolving performanceproblems because bottlenecks can arise at both the virtual-machine leveland the host-system level.

Existing performance-monitoring tools do not provide an easy way todiagnose performance problems in such computing systems.

BRIEF DESCRIPTION OF THE FIGURES

The patent or application file contains at least one drawing executed incolor. Copies of this patent or patent application publication withcolor drawing(s) will be provided by the Office upon request and paymentof the necessary fee.

FIG. 1 illustrates a performance-monitoring tool that displays aproactive monitoring tree in accordance with the disclosed embodiments.

FIG. 2A illustrates an exemplary proactive monitoring tree in accordancewith the disclosed embodiments.

FIG. 2B illustrates how nodes in a proactive monitoring tree can beselectively expanded in accordance with the disclosed embodiments.

FIG. 3 illustrates a system that facilitates executing virtual machinesin accordance with the disclosed embodiments.

FIG. 4A presents a flowchart illustrating how performance metrics can becollected in accordance with the disclosed embodiments.

FIG. 4B presents a flowchart illustrating how a proactive monitoringtree can be generated in accordance with the disclosed embodiments.

FIG. 5A illustrates a sorted proactive monitoring tree in accordancewith the disclosed embodiments.

FIG. 5B presents a flowchart illustrating how nodes in a proactivemonitoring tree can be sorted and displayed in accordance with thedisclosed embodiments.

FIG. 6A illustrates an exemplary state distribution ring in accordancewith the disclosed embodiments.

FIG. 6B presents a flowchart illustrating how a state distribution ringcan be displayed in accordance with the disclosed embodiments.

FIG. 7A presents a performance graph for a branch of the tree overlaidon a distribution of the performance metric over nodes in the tree inaccordance with the disclosed embodiments.

FIG. 7B presents a flowchart illustrating how the graph illustrated inFIG. 7A can be generated in accordance with the disclosed embodiments.

FIG. 8A illustrates a system that facilitates node pinning in accordancewith the disclosed embodiments.

FIG. 8B presents a flowchart illustrating the process of displaying apin board for a proactive monitoring tree in accordance with thedisclosed embodiments.

FIG. 9A illustrates a metric-selection screen in accordance with thedisclosed embodiments.

FIG. 9B illustrates a tree with parent nodes that are colored based onthe performance states of their child nodes in accordance with thedisclosed embodiments.

FIG. 9C illustrates a tree with state distribution rings in accordancewith the disclosed embodiments.

FIG. 9D illustrates a tree with sorted nodes in accordance with thedisclosed embodiments.

FIG. 9E illustrates another example of the graph illustrated in FIG. 9Din accordance with the disclosed embodiments.

FIG. 9F illustrates an exemplary pin board in accordance with thedisclosed embodiments.

FIG. 10 illustrates an example a block diagram of a data intake andquery system in accordance with the disclosed embodiments.

FIG. 11 illustrates a flowchart of a process that indexers may use toprocess, index, and store data received from forwarders in accordancewith the disclosed embodiments.

FIG. 12 illustrates a flowchart of a process that a search head andindexers perform during a typical search query in accordance with thedisclosed embodiments.

FIG. 13 illustrates an example of a search query received from a clientthat the search head can split into two parts in accordance with thedisclosed embodiments.

DETAILED DESCRIPTION Overview

The disclosed embodiments relate to a performance-monitoring system thatprovides a user interface that displays a proactive monitoring tree inaccordance with the disclosed embodiments. This proactive monitoringtree enables a user to easily view and understand relationships amongvarious factors that affect performance of a hierarchically structuredcomputing system. More specifically, a user can navigate the proactivemonitoring tree to gain a better understanding of the performance of anassociated computing system by examining values for a selectedperformance metric across a set of entities (e.g., virtual machines andhost systems) that comprise the computing system, wherein the entitiesare represented as nodes in the proactive monitoring tree. Values forthe selected metric can be aggregated for each of the entities over aselected time range and then compared against a set of thresholds todetermine performance states for the entities. These performance statescan be represented by using different colors to display associated nodesof the proactive monitoring tree. For example, performance states in avirtual machine environment can indicate whether the performance for aspecific entity (virtual machine or host system) is in a critical state(red), a warning state (orange), a normal state (green), or anunknown/offline state (gray).

The proactive monitoring tree enables a user to easily navigate thehierarchy by selectively expanding nodes representing sets of entities(e.g., computing clusters) to view performance information forlower-level nodes associated with lower-level entities (e.g., virtualmachines or host systems.) This ease of navigation enables a user toquickly diagnose the root cause of a performance problem.

An exemplary performance-monitoring system that provides a proactivemonitoring tree system is illustrated in FIG. 1. This system includes aperformance-monitoring tool 108 comprising a software application thatenables a user to monitor and analyze a set of performance data 110.

This performance data 110 can originate from various data sources 112.In general, performance data 110 can comprise any type of dataassociated with entities that can be hierarchically organized with aone-to-many relationship between entities. For example, performance data110 can originate from a virtual machine system and can specifyutilization rates for various resources, such as central-processing unit(CPU) capacity, memory capacity and communication bandwidth forindividual virtual machines or underlying host systems that comprise thevirtual machine system. In another example, performance data 110 canoriginate from a database containing economic data. In this example, thedata can relate to economic indicators such as per capita GDP,unemployment rates, and income distribution for the different states,counties and cities. In another example, performance data 110 canoriginate from a database containing census data. In this example, thedata can relate to racial, religious and ethnic compositions of variousstates, counties and cities. In yet another example, performance data110 can originate from a database containing information on communicablediseases. In this example, the data can relate to the number of cases ofspecific diseases and associated rates of mortality for differentcountries, states and cities. In another example, performance data 110can originate from a database containing financial information for acorporation. In this example, the data can relate to financialperformance for various subsidiaries, divisions and departments withinthe corporation.

Performance data 110 can also be collected using time windows that varyin size. For example, the data sources 112 can provide data valuescollected over time windows that range in size from microseconds, toseconds, to years.

Moreover, performance data 110 can comprise real-time data that iscollected periodically (e.g., every three minutes) from an activesystem. Alternatively, performance data 110 can comprise non-real-timedata, such as census data, that is collected every ten years.

Performance data 110 can also include values for many different types ofperformance metrics. For example, the performance metrics for a virtualmachine system can include: (1) CPU-related performance metrics, such asutilization per host, virtual machine, resource pool or computeresource; (2) disk-related performance metrics, such as disk utilizationper host, virtual machine, or datastore, wherein the disk metrics caninclude I/0 performance (such as latency and read/write speeds), andutilization metrics for storage as a finite resource; (3) memory-relatedperformance metrics, such as memory utilization per host, virtualmachine, resource pool, or compute resource; (4) network-relatedperformance metrics, such as network utilization for both physical andvirtual network interface controllers (NICs) and other network devices,such as virtual switches that support connectivity among systemcomponents, such as hosts, virtual machines and virtual machine kernels;(5) energy-usage statistics, such as energy usage per host; (6) datatraffic-related performance metrics, such as storage path data trafficstatistics and storage adapter data traffic statistics; (7) overallsystem availability performance metrics, such as uptime and systemheartbeat statistics; (8) cluster-related performance metrics, such ascluster utilization; and (9) virtual machine performance statistics,such as statistics related to virtual machine power and provisionaloperations. For more details on possible performance metrics, please seeU.S. patent Ser. No. 14/167,316 filed 29 Jan. 2014 that provides a listof such performance metrics and is hereby incorporated by referenceherein. Also, see “vSphere Monitoring and Performance” Update 1, vSphere5.5, EN-001357-00,http://pubs.vmware.com/vsphere-55/topic/com.vmware.ICbase/PDF/vsphere-esxi-vcenter-server-551-monitoring-performance-guide.pdf.

During operation, performance-monitoring tool 108 displays a userinterface 104 to a user 102. User interface 104 displays a proactivemonitoring tree 106 comprising nodes associated with specific entities,such as a virtual machine or a host system, or a set of entities, suchas a cluster of host systems or multiple clusters. These nodes provide avisual indicator (e.g., a color) to indicate performance states(associated with a specific performance metric) for each entity. Forexample, a red-colored node may indicate that a value of a performancemetric for the node is in a critical range. Note that a user 102 is ableto navigate the nodes of proactive monitoring tree 106 by selectivelyexpanding lower-level nodes to view performance information for entitiesrepresented by the nodes. This enables the user to determine the rootcause of a performance problem by quickly identifying an entity (e.g.,virtual machine) that is causing a performance bottleneck for thesystem.

Proactive Monitoring Tree

FIG. 2A illustrates an exemplary proactive monitoring tree 106 inaccordance with the disclosed embodiments. A proactive monitoring tree106 can generally be used to represent data values for any entities thathave one-to-many relationships (e.g., parent-child relationships) andare hierarchically structured to form one or more trees. For example, ina computing system that supports execution of virtual machines, eachnode in the proactive monitoring tree 106 can represent: (1) a virtualmachine; (2) a host system that executes one or more virtual machines;(3) a cluster comprising one or more host systems; or (4) a virtualcenter comprising one or more clusters. Hence, in FIG. 2A nodes 222-228can represent virtual machines, nodes 217-221 can represent host systemsthat execute virtual machines, nodes 215-216 can represent computingclusters comprising multiple host systems, and node 214 can represent avirtual center comprising multiple clusters.

Each node in proactive monitoring tree 106 can be colored to indicate aperformance state for the associated entity. For example, if theperformance metric is memory utilization, a node for a virtual machinecan be colored: red to indicate that memory utilization for the virtualmachine is in a critical range (e.g., over 99%); orange to indicate awarning range (e.g., 90% to 99%); green to indicate a normal range(e.g., 0% to 90%); and gray to indicate that memory utilization isunknown for the virtual machine. Note that performance states, and theassociated ranges of values for the performance states, can be fixed ormay be configurable by a user.

Performance states can alternatively be indicated in different ways(instead of by using colors), such as by using different patterns (e.g.,cross-hatching or dots), through different levels of gray-shading, orthrough textual labels that explicitly announce the performance state.

Moreover, the performance state for a parent node can depend on theperformance states of the parent's children. For example, theperformance state for a host node can depend on the worst-caseperformance state for any virtual machine that executes on the hostnode, the performance state for a cluster node can depend on theworst-case performance state for any host node in the cluster, and theperformance state for a virtual center node can depend on the worst-caseperformance state for any cluster in the virtual center.

More specifically, referring to FIG. 2A, the performance state for node215 is red because the worst-case performance state for child nodes219-221 is red; the performance state for node 217 is orange because theworst-case performance state for child nodes 222-225 is orange; theperformance state for node 218 is green because the worst-caseperformance state for child nodes 226-228 is green; the performancestate for node 216 is orange because the worst-case performance statefor child nodes 217-218 is orange; and finally, the performance statefor node 214 is red because the worst-case performance state for childnodes 215-216 is red.

Note that assigning performance states to a parent node based on theworst-case states for associated child nodes enables a viewer todetermine quickly which branches of the tree are likely to haveperformance problems. However, performance states can be assigned toparent nodes in alternative ways. For example, a performance state for aparent node can depend on the average performance state (or most-commonperformance state) of its child nodes.

Proactive monitoring tree 106 also supports navigational operations tofacilitate analyzing performance problems. While displaying a largesystem comprising hundreds or thousands of entities, it may beimpractical to display nodes for all of the entities at the same time.(Note that it may simply be impossible to fit hundreds or thousands ofnodes on a single display screen.) Even if it is possible to display alarge number of nodes in a single display screen, the large number ofdisplayed nodes can obscure performance problems for a small subset ofthe nodes that have performance problems.

To facilitate viewing systems with a large number of nodes, proactivemonitoring tree 106 enables the user to selectively expand parent nodesto display underlying child nodes. For example, FIG. 2B illustrates hownodes in the proactive monitoring tree can be selectively expanded by auser. On the left-hand side of FIG. 2B, the proactive monitoring tree isinitially displayed with three nodes 214-216. At this point, lower-levelnodes are hidden from the user. When the user selects (e.g., uses amouse to click on) node 216, node 216 expands to reveal underlying childnodes 217-218. When the user selects node 217, node 217 expands toreveal underlying child nodes 222-225. Note that if an expanded treedoes not completely fit on the screen, the user can grab and move thetree to change which portion of the expanded tree is displayed on thescreen. These navigational operations enable a user to quickly “drilldown” into a branch of interest to explore the performance states ofnodes in the branch. (Note that an expanded node can be selected againto hide its underlying children.)

By presenting performance information in this top-down manner, theproactive monitoring tree enables a user to identify where a computingsystem is experiencing performance problems, and to determine how thecomputing system can be modified to alleviate these problems.Furthermore, by associating performance values with a set of performancestates, a user can easily understand how different portions of thecomputing system are performing.

We next describe how such performance data can be collected in a serversystem that supports execution of virtual machines.

Exemplary Performance-Monitoring System

FIG. 3 illustrates an exemplary server system 300 that monitors theperformance of a virtual machine environment comprising a set of virtualmachines and associated host systems in accordance with the disclosedembodiments. As illustrated in FIG. 3, server system 300 is accessed bylocal systems 303 and 304 through network 301. Server system 300 cangenerally include a set of computational resources, such as acloud-based computer system comprising one or more geographicallydistributed data centers. Local systems 303 and 304 can generallyinclude any type of computer system that can interact with server system300. For example, local systems 303 and 304 can include a personalcomputer system, a server computer system, a laptop computer system, ora smartphone. Network 301 can generally include any type of network forconnecting computer systems. For example, network 301 can be a privatenetwork with dedicated communication links; a public network, such asthe Internet; or a virtual-private network (VPN) that operates over apublic network.

Local systems 303 and 304 include applications (not shown) which areoperated by users 305 and 306, respectively. (Note that theseapplications can be native applications or browser-based applications.)During operation, these applications in local systems 303 and 304 canoffload computational tasks to server system 300 through interactionswith a hypervisor 302. Hypervisor 302 controls the operation of a set ofvirtual machines 321-336 that execute computational tasks on a set ofunderlying physical host systems 341-356. Host systems 341-356 cangenerally include any type of single-core or multi-core computer systemincluding associated memory resources that can be used to executecomputational tasks.

Hypervisor 302 assigns tasks to be executed on specific virtual machinesor sets of virtual machines based on the task's requirements, thevirtual machine's capabilities, and the load on the virtual machines.Hypervisor 302 also assigns virtual machines to be executed onunderlying physical host systems based on the load on the underlyinghost systems and computational requirements of the virtual machines.

During operation, hypervisor 302 records values for a number ofperformance metrics for virtual machines 321-336 and host systems341-356 and makes these performance metric values available through anapplication programming interface (API) 308.

Virtual machine (VM) monitoring system 310 periodically makes callsthrough API 308 to retrieve values for these performance metrics andthen stores them in a database containing performance data 110. Morespecifically, referring to the flowchart illustrated in FIG. 4A, VMmonitoring system 310 retrieves values for a set of performance metricsby making calls through API 308 (step 402). Note that API 308 providesvarious methods or functions to retrieve values for the performancemetrics. In one embodiment, API 308 is an API provided as part of thevSphere Hypervisor™ system distributed by VMware, Inc. of Palo Alto,Calif. While retrieving values for the performance metrics fromhypervisor 302 through API 308, VM monitoring system 310 also retrievesarchitectural information specifying one-to-many relationships betweenentities in the computing environment. For example, this architecturalinformation can specify which virtual machines execute on each host,which hosts belong to each cluster, and which clusters belong to eachvirtual cluster.

Next, VM monitoring system 310 stores the retrieved values for theperformance metrics and associated timestamps along with thearchitectural information in database 110 (step 404). Then, VMmonitoring system 310 waits for a specified amount of time (406), andreturns to step 402 to retrieve the next set of performance metricvalues.

Process of Generating a Proactive Monitoring Tree

FIG. 4B presents a flowchart illustrating how a proactive monitoringtree 106 is generated by a performance-monitoring tool 108 in accordancewith the disclosed embodiments. Performance-monitoring tool 108 startswith a database containing performance data 110 for a set of entities(e.g., virtual machines and hosts), where database 110 was previouslygenerated as described above with reference to FIG. 4A.

First, the system receives a number of selections from a user,including: an entity type (e.g., virtual machine or host), a performancemetric (e.g., CPU utilization) and a time range (e.g., the past 24hours) (step 412). Next, the system accesses database 110 and retrievesvalues for the selected performance metric, entity type and time range(step 414). For example, if database 110 includes fields for performancemetric, entity type, entity identifier, and measurement time, theretrieval process can involve executing a query against database 110.This query retrieves values for the selected metric (and associatedentity identifiers) that match the specific entity type and time range.In one embodiment, database 110 is optimized to quickly return metricvalues for a specific time range. For example, database 110 can storeevents for the performance metric in a time-series index, wherein eventsare stored and can be accessed based on their timestamps.

Next, the system uses the obtained metric values to determineperformance states for the associated entities. This can be accomplishedby comparing the metric values against a set of threshold values for theperformance states (step 416).

The system also retrieves the architectural information specifying themany-to-one relationships between the entities at the time theperformance metric values were gathered (step 417).

The system then generates the proactive monitoring tree based on thedetermined performance states. This process can involve starting fromthe leaf nodes and constructing successive levels of parent nodes fromchild nodes (step 418). For example, the system can start with the leafnodes, wherein each leaf node is associated with a performance state forits associated entity (e.g., virtual machine or host system). Next, theperformance state for each parent node can be determined based on theworst-case performance state for each of its child nodes. This processis repeated until the root node of the tree is reached.

Finally, the system displays the proactive monitoring tree to the userand allows the user to navigate the proactive monitoring tree to analyzeperformance problems (step 420).

Proactive Monitoring Tree Features

In some embodiments, proactive monitoring tree 106 provides a number offeatures, including: (1) severity state sorting, (2) a statedistribution ring, (3) a distribution stream chart with branch overlay,and (4) a pin board that displays detail panels for nodes. Thesefeatures are described in more detail below.

Severity State Sorting

In some embodiments, branches of the proactive monitoring tree aresorted based a count of the most severe nodes in that branch. Hence, thebranch with the highest number of the highest severity leaf nodes willbe displayed on the far left-hand side of the tree. For example, in asystem that associates entities with a critical state, a warning state,a normal state and an unknown state, the branch with the highest numberof leaf nodes in the critical state will be displayed at the farleft-hand side of the tree. If there are no leaf nodes in the criticalstate, the branch with the highest number of leaf nodes in the warningstate will displayed at the far left-hand side of the tree.

This sorting process is performed top down. Hence, branches of the rootnode of the tree are first sorted based on the highest count of highestseverity leaf nodes. Then, branches of each branch node are sorted inthe same way. Hence, branches with the highest number of high severityleaf nodes are always displayed on the far left-hand side of the tree.

For example, in FIG. 5A, the tree 500 comprises nodes 514-528, whereinnode 514 is the root node. The most severe branch node 515 under rootnode 514 is displayed on the far left-hand side of root node 514. Thismeans that branch node 515 is associated with the most leaf nodes havingthe highest severity state. Similarly, leaf node 519 has the highestseverity state of all leaf nodes under branch node 515. Sorting thebranches in this way enables a user to easily determine which branchesin the tree are experiencing the most performance problems.

FIG. 5B presents a flowchart illustrating how tree nodes are displayedin sorted order in accordance with the disclosed embodiments. Duringoperation, the system first determines performance states for aplurality of entities that comprise the computing environment (step532). This can involve first determining values for a performance metricof each of the entities and then comparing the determined values againstthresholds to determine the performance states for the entities. Next,the system displays the computing environment as a tree with nodesrepresenting the plurality of entities and edges representingparent-child relationships between the plurality of entities (step 534).While displaying the tree, the system displays the child nodes for eachparent in sorted order based on values of the performance statesassociated with the child nodes (step 536).

State Distribution Ring

The state distribution ring can be implemented as a ring surroundingparent nodes of the tree. This ring provides an indicator of thedistribution of performance states for the leaf nodes that fall underthe parent node in the tree. More specifically, the ring is divided intovisually distinct sections associated with different performance states,wherein the visually distinct sections are sized proportionately withthe determined counts of leaf nodes with the associated performancestates. Note that the visually distinct sections can be displayed usingdifferent colors or different patterns. In this way, the user can get asense of the proportion of leaf nodes in a particular performance statefor a particular branch of the hierarchy. This can help a user indetermining which nodes they might be interested in clicking on toinvestigate. A node with a higher proportion of leaf nodes in a moresevere state is probably more interesting to investigate.

For example, FIG. 6A illustrates a state distribution ring 630, whichsurrounds a node for a cluster (CL) associated with a number ofdescendant nodes 635, including branch nodes and leaf nodes. Statedistribution ring 630 is divided into visually distinct sections 631-634which are sized proportionately with the counts of leaf nodes with theassociated performance states.

More specifically, FIG. 6B presents a flowchart illustrating how a statedistribution ring is displayed in accordance with the disclosedembodiments. During operation, the system determines performance statesfor a plurality of entities that comprise the computing environmentbased on values of a performance metric for the entities (step 662). Insome embodiments, the system determines the performance states for theplurality of entities by comparing the values of the performance metricfor the plurality of entities against one or more state-specificthreshold values to determine the associated performance states for theplurality of entities.

Next, the system displays the computing environment as a tree comprisingnodes representing the plurality of entities and edges representingparent-child relationships between the plurality of entities (step 664).For each leaf node in the tree, the system displays an indicator for aperformance state associated with the leaf node (step 666). For eachparent node in the tree, the system determines counts of one or moreperformance states for descendants of the parent node in the tree andthen displays a graphical representation of the determined counts whiledisplaying the parent node. In some embodiments, displaying thisgraphical representation involves displaying a circular ring comprisingvisually distinct sections associated with different performance states,wherein the visually distinct sections are sized proportionately withthe determined counts for the associated performance states (step 668).

Distribution Stream Chart with Branch Overlay

In some embodiments, when a user hovers a cursor over a node in thetree, a special distribution stream chart appears as is illustrated inFIG. 7A. In the foreground, this chart displays a line for the selectednode 740 that represents the average values for the selected metric forthe node. If the node is a leaf node, the line represents the averagefor the leaf node. If the selected node is a parent node, the linerepresents the average values of the metric over all leaf nodes underthe parent node. (Alternatively, instead of displaying a line for theaverage value of the leaf nodes, the system can allow the user to scrollthrough lines for each of the leaf nodes under the parent.)

The background of the chart represents the distribution of the selectedmetric's values over a reference set of nodes in the tree. Thisreference set of nodes can include the entire tree or merely a subset ofnodes in the tree. This distribution is represented by a number ofshaded regions. The interior, cross-hatched region represents the middle50% of the data. This interior region is therefore defined as havingedges representing the 25^(th) percentile of the data and the 75^(th)percentile of the data. (Note that this is analogous to the box portionof a box-and-whisker plot.) The lower exterior, darker-shaded region hasa lower bound of the minimum value of the data, the 0^(th) percentile ifyou will, and an upper bound at the 25^(th) percentile line. The upperexterior region is upper-bounded by the 95^(th) percentile line andlower-bounded by the 75^(th) percentile line. Note that the upper boundin a box-and-whisker plot is typically the maximum value of the data.However, this can be greatly affected by outliers; hence, theillustrated embodiment limits the upper region to the 95^(th) percentileof the data.

Note that the boundaries in the distribution are not meant to be limitedto the 0^(th), 25^(th), 75^(th) and 95^(th) percentiles. In general, themaximum value, other percentile values and other measures, such asstandard deviations, can be used.

In a variation on this embodiment, if the selected node is a parentnode, instead of displaying the average value of the metric over allleaf nodes under the parent, the system can display a foregrounddistribution for the leaf nodes under the parent. This foregrounddistribution is overlaid on a background distribution for the selectedmetric over all nodes in the tree. (This overlaying process may involveusing different colors or different levels of transparency andtranslucency.)

The value of this chart is that a user can see how performance for aparticular branch of the hierarchy compares to the entirety of the tree.This enables the user to make inferences based on the behavior of aparticular branch deviating from the distribution of the computingenvironment as a whole, and these inferences can help the user optimizeperformance of the computing environment.

More specifically, FIG. 7B presents a flowchart illustrating how thegraph illustrated in FIG. 7A is generated in accordance with thedisclosed embodiments. First, the system determines values for aperformance metric for a plurality of entities that comprise thecomputing environment (step 772). Next, the system displays thecomputing environment as a tree comprising nodes representing theplurality of entities and edges representing parent-child relationshipsbetween the plurality of entities (step 774). Then, for a selected nodein the tree, the system displays a chart with a line illustrating how avalue of the performance metric for the selected node varies over timeagainst a background illustrating how a distribution of the performancemetric for a reference set of nodes in the tree varies over time (step776). Note that if the selected node is a parent node, the value of theperformance metric for the selected node is an average value for theperformance metric across descendant nodes of the selected node in thetree. Moreover, the background includes a stream chart comprisingregions associated with percentile ranges, wherein borders between theregions represent one or more of the following: a minimum value line, a25^(th) percentile line, a 50^(th) percentile line, a 75^(th) percentileline, a 95^(th) percentile line, a maximum value line, and a lineassociated with a standard deviation.

Node Pinning

FIG. 8A illustrates how a performance state of a node in the tree can be“pinned” onto a pin board to facilitate comparisons with the states ofother nodes in the tree in accordance with the disclosed embodiments.For example, when a user hovers a cursor over a node (say node 814), apin icon is displayed in a tooltip. If the user clicks on the pin icon,a detail panel for the node is displayed on a pin board 850 located onthe far right-hand side of the screen. Note that the state of thisdetail panel is frozen at the time of pinning. This means that the usercan manipulate the tree, for example by changing the performance metric,time range or entity type, and this pinned detail panel remainsunchanged. The user can then pin another node, or can pin the same nodefor a different metric to pin board 850. This enables the user tocompare different performance metrics simultaneously. An exemplary nodedetail panel 841 can include configuration information 842 for theentity associated with the node, and can also display a graph 843 forthe selected metric, such as a graph of CPU utilization over time.

The content of the pinned detail panel 841 can vary as a function of thetype of node pinned. For example, the detail panel for a host system canshow information specifying that host's manufacturer and the number ofnetwork interface cards and processors, while a detail panel for avirtual machine can show information associated with provisioning of thevirtual machine, the guest OS running on it, etc. As mentioned above,the second portion of the pinned detail panel can display a graph for aselected metric. However, if the pinned node is a branch node, insteadof showing a distribution stream chart for the node, the system candisplay a table with the top 50 most critical children in the branch,wherein each entry in the table includes an indicator of the performancestate of the node, the name of the node, and a sparkline for theselected metric value for that node over the selected time range.

FIG. 8B presents a flowchart illustrating how a pin board is displayedin accordance with the disclosed embodiments. During operation, thesystem determines performance states for a plurality of entities thatcomprise the computing environment based on values of a performancemetric for the entities (step 882). Next, the system displays thecomputing environment as a tree comprising nodes representing theplurality of entities and edges representing parent-child relationshipsbetween the plurality of entities (step 884). Then, in response to theuser selecting a first node in the tree to be pinned, the systemdisplays a first detail panel for the first node, wherein the firstdetail panel displays state information for the first node, wherein thestate information is frozen at the time of pinning (step 886). Next, inresponse to the user selecting a second node in the tree to be pinned,the system displays a second detail panel for the second node, whereinthe second detail panel displays state information for the second node,wherein the state information is frozen at the time of pinning (step888). Note that displaying the first detail panel concurrently with thesecond detail panel facilitates comparing state information between thefirst and second nodes.

Monitoring Tree for a Virtual Machine Environment

We next present some exemplary screen shots for a proactive monitoringtree representing a virtual machine environment. This monitoring treeincludes nodes for various entities in the virtual machine environment.More specifically, these entities include: a physical host system (HS),a virtual machine (VM); a cluster comprising one or more host systems(CL); and a virtual center comprising one or more clusters (VC). In someembodiments, the virtual machines are automatically load-balanced amonghosts in a cluster, wherein virtual machines assigned to stand-alonehosts remain on the stand-alone hosts permanently.

Before the proactive monitoring tree can be displayed, the user selectsa number of parameters for the tree as is illustrated in FIG. 9A. Theillustrated parameters include: (1) an entity type of “virtual machine;”(2) a performance type of “CPU;” (3) an associated metric of “averageCPU usage;” and (4) a time range of “last 24 hours.” This causes thesystem to aggregate the selected performance metric over the selectedtime range for all matching entities of the selected entity type in thevirtual machine environment. For example, this can involve taking anaverage (or some other aggregation) of performance metric values foreach entity over the selected time range. Moreover, in a virtual-machineenvironment, the selected entity type can be a “virtual machine” or a“host system,” and the selection changes whether the leaf nodesrepresent virtual machines or host systems. This is significant, becausethe system gathers direct performance measurements for the leaf nodeswhose states bubble up to parent nodes and are displayed in the parentnodes' associated rings. Next, the system compares the aggregated valuesagainst a set of user-defined thresholds to determine “performancestates” for the entities, wherein the performance states are displayedusing different colors. More specifically, the performance states for aspecific entity can be: a critical state (red), a warning state(orange), a normal state (green), or an unknown/offline state (gray).

The system then displays a proactive monitoring tree for the selectedperformance metric as is illustrated in FIG. 9B. The highest-level nodein the tree illustrated in FIG. 9B is a cluster node 901, which iscolored red to indicate that the ultimate children (leaf nodes) ofcluster node 901 contain at least one node in the critical state.Cluster node 901 has a number of child nodes representing physical hostsystems, including: node 902, colored red to indicate that at least oneof its child nodes is red; node 903, colored orange to indicate that itsworst child node is orange and none of its child nodes are red; and node904, colored green to indicate that its worst child node is green andnone of its child nodes are red or orange. Note that when the userclicks on a node, the node expands to reveal its child nodes at a lowerlevel of the tree.

For each parent node in the tree, the system computes counts of theperformance states for all of the leaf nodes under the parent node. Thiscan involve maintaining an array for each node containing counts ofstates of the leaf nodes associated with each node or branch in the tree[red, orange, green, gray].

In the case of a leaf node, the array for a leaf node includes a single“1” value for the performance state of the leaf node. The array for aparent node is computed by adding the arrays for all immediatedescendants of the parent node.

Around each node in the tree, the system displays a state distributionring comprising visually distinct sections associated with differentperformance states, wherein the visually distinct sections are sizedproportionately with the determined counts for the associatedperformance states. For example, in FIG. 9C, node 905 is the root nodeof a tree, which is surrounded by a ring with colored sections thatrepresent the proportions of states of the leaf nodes in the tree. Notethat 15-20% of this ring is red, which indicates that 15-20% of the leafnodes in the tree are red. Nodes 907-908 are surrounded by rings thatare completely green, which indicates that all of their descendant nodesare green. Node 906 actually has a higher proportion of red nodes thanits siblings or parent. However, it does not have the largest number ofred nodes of its siblings and hence does not appear on the far left-handside of the tree in the sorted ordering of the siblings. Nevertheless,node 906 may be interesting to examine because of its higher proportionof red nodes.

As mentioned above, the nodes of the proactive monitoring tree areorganized in sorted order based on the states of the nodes. This sortingcan be accomplished as follows. We first look at virtual centers (ifthere are more than one), and the virtual center with the most reds isdisplayed on the far left-hand side of the display. Then, within thatvirtual center, we look at the clusters, and the cluster with the mostreds in its branch goes on the far left. Then, within that cluster, wego to the host system level, and the host system with the most redswithin that cluster goes on the far left. Finally, within the leaves wesort the leaves red to orange to green to gray. If a branch has no reds,it is always sorted after a node with at least one red, and then itscount of oranges is compared against the other siblings with no reds; ifa branch has no oranges, it always falls behind anything with at leastone orange. This sorting system works in conjunction with the ringsmentioned above to allow the user to quickly determine where to look forperformance problems. The branches with the most reds and the highestproportion of reds are typically the most interesting to investigate.For example, the sorted ordering for an exemplary set of sibling nodesis illustrated in FIG. 9D. The sibling with the most reds appears on thefar left. The sibling with no reds appears to the far right and all thenodes in between are sorted based on the number of reds they represent.

FIG. 9E presents an exemplary distribution stream chart with a branchoverlay. In this chart, the white line illustrates an average value forthe selected branch or entity, the middle light-shaded region representsthe middle 50% of the entities in the tree, the lower dark-shaded regionrepresents the lower 25% of the entities, and the upper dark-shadedregion represents the 20% of the entities below the top 5% of theentities.

Finally, FIG. 9F illustrates an exemplary pin board 909 with two detailpanels. The lower detail panel represents a leaf node. It displaysvarious configuration information for the leaf node, such as the powerstate and number of CPUs. It also displays a graph for the selectedmetric, which is overlaid on a distribution for the selected metricacross all nodes in the tree. In contrast, the upper detail panelrepresents a parent node. This parent panel displays configurationinformation, such as the average effective CPU frequency in megahertzand the average effective memory, for all leaf nodes under the parentnode. It also displays a sparkline for the selected performance metricfor each of the leaf nodes under the parent node. These sparklinesillustrate how the selected performance metric varies over time.

Process of Gathering Data

We now provide additional details about how performance data can begathered. In general, this data-gathering process can be used to gatherany type of performance data from any type of system that producesperformance data, such as a computer system, an aircraft, a nuclearreactor or a even financial-trading system. In particular, thedata-gathering process can be applied to gather data in the virtualmemory monitoring system 210 illustrated in FIG. 2 above.

There is tremendous growth in the amount of data generated in the world.With decreasing storage costs and seemingly infinite capacity due tocloud services, there are fewer reasons to discard old data, and manyreasons to keep it. As a result, challenges have shifted towardsextracting useful information from massive quantities of data.

Mining a massive dataset is non-trivial but a more challenging task isto cross-correlate and mine multiple datasets from various sources. Forexample, a datacenter monitors data from thousands of components; thelog format and collection granularities vary by component type andgeneration. The only underlying assumption that can be made is that eachcomponent has a notion of time, either via timestamps or eventsequences, that is captured in the logs. As the quantity and diversityof data grow, there is an increasing need for performing full textsearches to mine the data.

Another challenge is that a large fraction of the world's data isunstructured, making it difficult to index and query using traditionaldatabases.

Even if a dataset is structured, the specifics of the structure mayevolve with time, for example, as a consequence of system upgrades ormore/less restrictive data collection/retention policies.

SPLUNK® ENTERPRISE is software produced and sold for on-premise andcloud use by Splunk Inc. of San Francisco, Calif. SPLUNK ENTERPRISE is acomprehensive system that generates, stores, retrieves, and searchesevent data. SPLUNK® ENTERPRISE has gained particular appeal in themarket for deriving events from unstructured data and machine data. Itis the leading software for providing real-time operationalintelligence, enabling organizations to collect, index, and harnessmachine-generated big data coming from the websites, applications,servers, networks, mobile devices, etc., that power their businesses.

At a high level, SPLUNK® ENTERPRISE can take raw data, unstructureddata, or machine data such as data in Web logs, syslogs, sensorreadings, etc., divide the data up into portions, and optionallytransform at least part of the data in these portions to producetime-stamped events. The software derives the time stamp for each eventby extracting it from the event data itself or by interpolating anevent's time stamp relative to other events for which the software canderive a time stamp. SPLUNK® ENTERPRISE then stores the events in atime-series data store against which it can run queries to retrieveevents that meet specified criteria, such as having certain keywordsand/or having certain value(s) for certain defined field(s).

SPLUNK® ENTERPRISE is particularly noteworthy for employing a so-called“late-binding schema.” As noted, an event in SPLUNK® ENTERPRISEtypically contains a portion of raw data (or a transformed version ofsuch). To run queries against events other than those involving keywordsearches, a schema can be developed. Such a schema can includeextraction rules for one or more fields. Each field can be defined for asubset of the events in the data store and an extraction rule canspecify how to extract a value from each of the subset of events forwhich the field has been defined. The extraction rule for a field isoften defined using a regular expression (“regex” rule), and itassociates event data with a logical type of information that iscontained within an event for which it is defined. The term“late-binding schema” refers to a system, such as in SPLUNK® ENTERPRISE,which does not define the schema at index time as with databasetechnology; rather, in a system involving late-binding schema, theschema can be developed on an ongoing basis up until the time it needsto be applied (which is query time, as a query often specifies thecriteria for events of interest in terms of events having specifiedvalue(s) for specified field(s)). As a data analyst learns more aboutthe data in stored events, using a late-binding schema, he can continueto develop the schema up until the next time it is needed for a query.

Because SPLUNK® ENTERPRISE maintains the underlying searchable raw dataand enables application of a late-binding schema, it has great power toenable dynamic investigation of issues that arise as a data analystlearns more about the data stored in the system's events.

As discussed herein, “time-series data” and “time-series machine data”may include, among other things, a series or sequence of data pointsgenerated by one or more data sources, computing devices, or sensors.Each data point may be a value, a small segment of data, or a largesegment of data, and each data point may be associated with a timestampor be associated with a particular point in time that provides the basisfor a timestamp for the data point. The series of data points, orvalues/statistics derived from the data points, may be plotted over atime range or time axis representing at least a portion of the timerange. The data can be structured, unstructured, or semi-structured andcan come from files, directories, network packets, network events,and/or sensors. Unstructured data may refer, for example, to data whosestructure is not fully understood or appreciated at the time the data isobtained by a data storage system, or it may refer to data that wasgenerated without a particular schema in mind to facilitate theextraction of values for fields in the data during a search on the data.Machine data generated by, for example, data sources within anenterprise network environment is generally considered to beunstructured data. The visualization of such time-series data may beused to display statistical trends over time. The time-series machinedata collected from a data source may be segmented or otherwisetransformed into discrete events, where each event can be associatedwith a timestamp.

An “event” may include a single record of activity from a particulardata source associated with a single timestamp. Such an event maycorrespond to, for example, one or more lines in a log file or otherdata input. Further, “events” may be derived from processing or indexingmachine data, as described herein, or may include other kinds of eventsor notable events described herein. Events can also correspond to anytime-series data, such as performance measurements of an IT component(e.g., a computer cluster, node, host, virtual machine, etc.), a sensormeasurement, etc.

In an example, a field extractor within an enterprise networkenvironment may be configured to automatically identify (e.g., usingregular expression-based rules, delimiter-based rules, etc.) certainfields in the events while the events are being created, indexed, and/orstored. Alternatively, one or more fields can be identified within theevents and added to the field extraction rules (used by the fieldextractor to identify fields within the events) by a user using avariety of techniques. Additionally, fields that correspond to metadataabout the events, such as a timestamp, host, source, and source type foran event, may also be created; such fields may, in some cases, bereferred to as “default fields” if they are determined automatically forall events at the time such events are created, indexed, and/or stored.

In some implementations, a given tag or alias may be assigned to a setof two or more fields to identify multiple fields that correspond toequivalent pieces of information, even though those fields may havedifferent names or be defined for different sets of events. A set oftags or aliases used to identify equivalent fields in this way may bereferred to as a common information model.

Data generated by various data sources may be collected and segmentedinto discrete events, each event corresponding to data from a particularpoint in time. Examples of such data sources include, but are notlimited to, web servers, application servers, databases, firewalls,routers, operating systems, software applications executable at one ormore computing devices within the enterprise data system, mobiledevices, sensors, etc. The types of data generated by such data sourcesmay be in various forms including, for example and without limitation,server log files, activity log files, configuration files, messages,network packet data, performance measurements or metrics, sensormeasurements, etc.

FIG. 10 shows a block diagram of SPLUNK® ENTERPRISE's data intake andquery system, which provides an example embodiment of a data intake andquery system 1000. Generally, the system 1000 includes one or moreforwarders 1001 that collect data from a variety of different datasources 1005. The forwarders determine which indexer or indexers are toreceive the data and forward the data to one or more indexers 1002. Thedata typically includes streams of time-series data. Time-series datarefers to any data that can be segmented such that each segment can beassociated with a time stamp. The data can be structured, unstructured,or semi-structured and can come from files and directories. Unstructureddata is data that is not organized to facilitate the extraction ofvalues for fields from the data, as is often the case with machine dataand web logs, two popular data sources for SPLUNK® ENTERPRISE.Alternatively, heavy forwarders can strip out extraneous data and detecttime stamps for the data. Based on the time stamps, the heavy forwarderscan index and group the data into buckets that fall within a common timespan. The heavy forwarders then determine which indexer or indexers areto receive each bucket of data and forward the data to one or moreindexers 1002.

FIG. 11 is a flowchart 1100 of a process that indexers 1002 may use toprocess, index, and store data received from the forwarders 1001. Atblock 1101, an indexer 1002 receives data from a forwarder 1001. Atblock 1102, the indexer segments the data into events. The datatypically consists of many lines of text that are separated by acarriage return or line break. An event may consist of one or more ofthese lines. The task of the indexer is to determine where an eventbegins and ends in the lines of data. The indexer can use heuristicsthat allow it to automatically determine how many lines constitute anevent. The indexer may be informed of the source of the data and have aset of heuristic rules for the source. The indexer may also be able toexamine a sampling of the data and automatically determine the source ofthe data and have a set of heuristic rules for that source. Theseheuristics allow the indexer to use regular expression-based rules,delimiter-based rules, etc., to examine the text in each line in orderto combine lines of data to form an event. The indexer can examine thetext for event boundaries within the text that include, but are notlimited to: predefined characters, character strings, etc. These mayinclude certain punctuation marks or special characters including, forexample, carriage returns, tabs, spaces, line breaks, etc. In someinstances, a user can fine tune or configure the rules that the indexersuse to examine the text in order to adapt to the user's equipment.

The indexer determines a time stamp for each event at block 1103. Thetime stamp can be determined by extracting the time from data in theevent or by interpolating the time based on time stamps from otherevents. In some cases, a time stamp can be determined from the time thedata was received or generated. The indexer associates the time stampwith each event at block 1104. For example, the time stamp may be storedas metadata for the event.

At block 1105, the data included in a given event can be transformed.Such a transformation can include such actions as removing part of anevent (e.g., a portion used to define event boundaries, extraneous text,characters, etc.) or removing redundant portions of an event. A user canspecify a portion to remove using a regular expression or any similarmethod.

Optionally, a key word index can be built to facilitate fast keywordsearching of events. To build such an index, in block 1106, the indexeridentifies a set of keywords contained in the events. At block 1107, theindexer includes each identified keyword in an index, which associateswith each stored keyword pointers to each event containing that keyword(or locations within events where that keyword is found). When anindexer receives a keyword-based query, the indexer can then consultthis index to quickly find those events containing the keyword withouthaving to examine again each individual event, thereby greatlyaccelerating keyword searches.

The indexer stores events in a data store at block 1108. The data can bestored in working, short-term and/or long-term memory in a mannerretrievable by query. The time stamp can be stored along with each eventto help optimize searching the events by time range.

In some instances, the stored data includes a plurality of individualstorage buckets, each corresponding to a time range. An event can thenbe stored in a bucket associated with a time range inclusive of theevent's time stamp. This not only optimizes time based searches, but itcan allow events with recent time stamps that may have a higherlikelihood of being accessed to be stored at preferable memory locationsthat lend to quicker subsequent retrieval (such as flash memory insteadof hard disk media).

Data stores 1003 may be distributed across multiple indexers, eachresponsible for storing and searching a subset, or buckets, of theevents generated by the system. By distributing the time-based bucketsamong the indexers, the indexers can find events responsive to a queryin parallel using map-reduce techniques, each returning their partialresponses for specific buckets to the query to a search head thatcombines the results together to answer the query.

FIG. 12 is a flowchart 1200 of a process that a search head 1004 andindexers 1002 may perform during a typical search query. At block 1201,a search head receives a query from a client.

At block 1202, the search head is responsible for analyzing the searchquery to determine what part can be delegated for execution by indexersand what part needs to be executed by the search head. Streamingcommands can be trivially delegated to the indexers. Conversely,aggregating commands are more complex to distribute.

The search head can perform optimization steps in order to make thesearch more efficient. As mentioned above, the indexers may create anindex of keywords. In one optimization, before the search startsexecuting, the search head determines the time range required for thesearch and a set of common keywords that all matching events must have.The retrieval phase uses these parameters to query the indexers for asuperset of the eventual results. The indexers return the superset ofresults that the search head can perform a filtering stage on. Thefiltering stage performs field extraction on the superset to arrive at areduced set of search results.

In another optimization, to achieve better computation distribution andminimize the amount of data transferred between indexers and the searchhead, many aggregating commands implement a map operation which thesearch head can delegate to the indexers while executing the reduceoperation locally. FIG. 13 shows an example of a search query 1301received from a client that the search head can split into two parts:one part to be executed by indexers 1302 and one part to be executed bythe search head 1303. Here, the search query 1302 makes the indexersresponsible for counting the results by host and then sending theirresults to the search head. The search head then performs the merging1303. This achieves both computation distribution and minimal datatransfer.

The search head distributes the indexer search query to one or moredistributed indexers. The search query may contain one or more regularexpressions that the indexer is to apply to any event data that is foundto fall within the parameters of the regular expression. These indexerscan include those with access to data stores having events responsive tothe query. For example, the indexers can include those with access toevents with time stamps within part or all of a time period identifiedin the query.

At block 1203, one or more indexers to which the query was distributedsearches its data store for events responsive to the query. To determineevents responsive to the query, a searching indexer finds eventsspecified by the criteria in the query. This criteria can include thatthe events have particular keywords or contain a specified value orvalues for a specified field or fields (because this employs alate-binding schema, extraction of values from events to determine thosethat meet the specified criteria occurs at the time this query isprocessed). It should be appreciated that, to achieve high availabilityand to provide for disaster recovery, events may be replicated inmultiple data stores, in which case indexers with access to theredundant events and not assigned as the primary indexer for the events,would not respond to the query by processing the redundant events. In anexample, the indexer finds events that it is the primary indexer forthat fall within a block of time specified by the one or more regularexpressions. The indexer then processes the contents of the events usingthe one or more regular expressions, extracting information associatedwith fields specified in the one or more regular expressions. Theindexers can either stream the relevant events back to the search heador use the events to calculate a partial result responsive to the queryand send the partial result back to the search head. At block 1204, thesearch head combines or reduces all of the partial results or eventsreceived from the parallel processing indexers together to determine afinal result responsive to the query.

Data intake and query system 1000 and the processes described withrespect to FIGS. 10-13 are further discussed and elaborated upon inCarasso, David. Exploring Splunk Search Processing Language (SPL) Primerand Cookbook. New York: CITO Research, 2012 and in Ledion Bitincka,Archana Ganapathi, Stephen Sorkin, and Steve Zhang. Optimizing dataanalysis with a semi-structured time series database. In SLAML, 2010.Each of these references is hereby incorporated by reference in itsentirety for all purposes.

SPLUNK® ENTERPRISE can accelerate some queries used to periodicallygenerate reports that, upon each subsequent execution, are intended toinclude updated data. To accelerate such reports, a summarization engineperiodically generates a summary of data responsive to the querydefining the report for a defined, non-overlapping subset of the timeperiod covered by the report. For example, where the query is meant toidentify events meeting specified criteria, a summary for a given timeperiod may include only those events meeting the criteria Likewise, ifthe query is for a statistic calculated from events, such as the numberof events meeting certain criteria, then a summary for a given timeperiod may be the number of events in that period meeting the criteria.

Because the report, whenever it is run, includes older time periods, asummary for an older time period can save the work of having to re-runthe query on a time period for which a summary was generated, so onlythe newer data needs to be accounted for. Summaries of historical timeperiods may also be accumulated to save the work of re-running the queryon each historical time period whenever the report is updated.

A process for generating such a summary or report can begin byperiodically repeating a query used to define a report. The repeatedquery performance may focus on recent events. The summarization enginedetermines automatically from the query whether generation of updatedreports can be accelerated by creating intermediate summaries for pasttime periods. If it can, then a summarization engine can periodicallycreate a non-overlapping intermediate summary covering new data obtainedduring a recent, non-overlapping time period and stores the summary in asummary data store.

In parallel to the creation of the summaries, the query engine schedulesthe periodic updating of the report defined by the query. At eachscheduled report update, the query engine determines whetherintermediate summaries have been generated covering parts of the timeperiod covered by the current report update. If such summaries exist,then the report is based on the information from the summaries;optionally, if additional data has been received that has not yet beensummarized but that is required to generate a complete report, then thequery is run on this data and, together with the data from theintermediate summaries, the updated current report is generated. Thisprocess repeats each time an updated report is scheduled for creation.

Search and report acceleration methods are described in U.S. Pat. Nos.8,589,403, issued on Nov. 19, 2013, and U.S. Pat. No. 8,412,696, issuedon Apr. 2, 2011, both of which are hereby incorporated by reference intheir entirety for all purposes.

Conclusion

The disclosed embodiments relate to a system that displays performancedata for a computing environment. During operation, the system firstdetermines values for a performance metric for a plurality of entitiesthat comprise the computing environment. Next, the system displays thecomputing environment as a tree comprising nodes representing theplurality of entities and edges representing parent-child relationshipsbetween the plurality of entities. While displaying the tree, the systemdisplays the child nodes for each parent in sorted order based on valuesof the performance metric associated with the child nodes.

In some embodiments, the system determines the values for the selectedperformance metric by receiving, from a user, a selection of theperformance metric from a set of monitored performance metrics; and thenobtaining the values for the selected performance metric for theplurality of entities from the performance data for the computingenvironment.

In some embodiments, while determining the sorted order for the childnodes, the system first determines a performance state for each childnode based on a value of the performance metric for an entity associatedwith the child node, wherein the performance states can include acritical state, a warning state, a normal state, and an unknown state.Moreover, if a child node has descendants in the tree, the performancestate associated with the child node includes performance states for thedescendants of the child node. Next, the system sorts the child nodesbased on the determined performance states, wherein the sorted order isdetermined based on the number of critical states associated with eachchild node.

In some embodiments, the system determines the performance states forthe plurality of entities by comparing the values of the performancemetric for the plurality of entities against one or more state-specificthreshold values to determine the associated performance states for theplurality of entities.

In some embodiments, an entity can include: a host system; a virtualmachine; a cluster comprising one or more host systems; and a virtualcenter comprising one or more clusters.

In some embodiments, the performance metric relates to one or more of:central-processing unit (CPU) utilization; memory utilization; diskutilization; and network utilization.

The disclosed embodiments also relate to a system that displaysperformance data for a computing environment. During operation, thesystem determines performance states for a plurality of entities thatcomprise the computing environment based on values of a performancemetric for the entities. Next, the system displays the computingenvironment as a tree comprising nodes representing the plurality ofentities and edges representing parent-child relationships between theplurality of entities. Then, for each parent node in the tree, thesystem determines counts of one or more performance states fordescendants of the parent node in the tree. Finally, the system displaysa graphical representation of the determined counts while displaying theparent node.

In some embodiments, displaying the graphical representation of thedetermined counts includes displaying a circular ring comprisingvisually distinct sections associated with different performance states,wherein the visually distinct sections are sized proportionately withthe determined counts for the associated performance states.

In some embodiments, while displaying each leaf node in the tree, thesystem displays an indicator for a performance state associated with theleaf node.

In some embodiments, for a selected node in the tree, the systemdisplays a chart with a line illustrating how a value of the performancemetric for the selected node varies over time, wherein the line isdisplayed against a background illustrating how a distribution of theperformance metric for a reference set of nodes in the tree varies overtime.

In some embodiments, if the selected node is a parent node, the value ofthe performance metric for the selected node is an average value for theperformance metric across descendant nodes of the selected node in thetree.

In some embodiments, the background includes a stream chart comprisingregions associated with percentile ranges, wherein borders between theregions represent one or more of the following: a minimum value line, a25^(th) percentile line, a 50^(th) percentile line, a 75^(th) percentileline, a 95^(th) percentile line, a maximum value line, and a lineassociated with a standard deviation.

In some embodiments, in response to the user selecting a first node inthe tree to be pinned, the system displays a first detail panel for thefirst node, wherein the first detail panel displays state informationfor the first node, wherein the state information is frozen at the timeof pinning. Moreover, in response to the user selecting a second node inthe tree to be pinned, the system displays a second detail panel for thesecond node, wherein the second detail panel displays state informationfor the second node, wherein the state information is frozen at the timeof pinning. Note that the first detail panel is displayed concurrentlywith the second detail panel to facilitate comparing state informationbetween the first and second nodes.

In some embodiments, the state information for the first node displayedin the first detail panel includes: configuration information for thefirst node; and a graph displaying values of the first performancemetric for the first node over a time interval.

In some embodiments, if the first node is a parent node in the tree, thestate information for the first node displayed in the first detail panelincludes:

aggregated configuration information for one or more descendants of thefirst node; and one or more graphs displaying values of the firstperformance metric for the one or more descendants of the first node.

In some embodiments, if the first node and the second node are the samenode, and if the user selects a second performance metric prior toselecting the second node to be pinned, while displaying the firstdetail panel the system displays state information for the firstperformance metric, and while displaying the second detail panel thesystem displays state information for the second performance metric.Note that the concurrent display of the first and second detail panelsenables the user to view state for the first and second performancemetrics for the same node at the same time.

The detailed description that appears above is presented to enable anyperson skilled in the art to make and use the disclosed embodiments, andis provided in the context of a particular application and itsrequirements. Various modifications to the disclosed embodiments will bereadily apparent to those skilled in the art, and the general principlesdefined herein may be applied to other embodiments and applicationswithout departing from the spirit and scope of the disclosedembodiments. Thus, the disclosed embodiments are not limited to theembodiments shown, but are to be accorded the widest scope consistentwith the principles and features disclosed herein.

The data structures and code described in this detailed description aretypically stored on a computer-readable storage medium, which may be anydevice or medium that can store code and/or data for use by a system.The computer-readable storage medium includes, but is not limited to,volatile memory, non-volatile memory, magnetic and optical storagedevices such as disk drives, magnetic tape, CDs (compact discs), DVDs(digital versatile discs or digital video discs), or other media capableof storing code and/or data now known or later developed.

The methods and processes described in the detailed description sectioncan be embodied as code and/or data, which can be stored on anon-transitory computer-readable storage medium as described above. Whena system reads and executes the code and/or data stored on thenon-transitory computer-readable storage medium, the system performs themethods and processes embodied as data structures and code and storedwithin the non-transitory computer-readable storage medium.

Furthermore, the methods and processes described below can be includedin hardware modules. For example, the hardware modules can include, butare not limited to, application-specific integrated circuit (ASIC)chips, field-programmable gate arrays (FPGAs), and otherprogrammable-logic devices now known or later developed. When thehardware modules are activated, the hardware modules perform the methodsand processes included within the hardware modules.

Moreover, the foregoing descriptions of disclosed embodiments have beenpresented only for purposes of illustration and description. They arenot intended to be exhaustive or to limit the disclosed embodiments tothe forms disclosed. Accordingly, many modifications and variations willbe apparent to practitioners skilled in the art.

Additionally, the above disclosure is not intended to limit thedisclosed embodiments. The scope of the disclosed embodiments is definedby the appended claims.

What is claimed is:
 1. A computer-implemented method for displayingperformance data for a computing environment, the method comprising:displaying the computing environment as a tree including nodesrepresenting a plurality of entities that comprise the computingenvironment and edges representing parent-child relationships betweenthe plurality of entities; and in response to the user selecting a firstnode in the tree to be pinned, displaying a first detail panel for thefirst node concurrently with displaying the tree, wherein the firstdetail panel displays state information for the first node that remainsunchanged after pinning; in response to the user selecting a second nodein the tree to be pinned, displaying a second detail panel for thesecond node concurrently with displaying the tree, wherein the seconddetail panel displays state information for the second node that remainsunchanged after pinning; and wherein the first detail panel is displayedconcurrently with the second detail panel to facilitate comparing stateinformation between the first and second nodes.
 2. Thecomputer-implemented method of claim 1, wherein when the first node is aparent node, the state information for the first node displayed in thefirst detail panel includes an aggregated configuration information ofone or more descendants of the first node; and wherein when the firstnode is a leaf node, the state information for the first node displayedin the first detail panel includes a configuration information for thefirst node.
 3. The computer-implemented method of claim 1, wherein whenthe first node and the second node are the same node, and when the userselects a second performance metric prior to selecting the second nodeto be pinned: displaying the first detail panel involves displayingstate information for the first performance metric; displaying thesecond detail panel involves displaying state information for the secondperformance metric; and wherein the concurrent display of the first andsecond detail panels enables the user to view state for the first andsecond performance metrics for the same node at the same time.
 4. Thecomputer-implemented method of claim 1, wherein prior to displaying thetree, the method further comprises: receiving, from a user, a selectionof the first performance metric from a set of monitored performancemetrics; and obtaining the values for the first performance metric forthe plurality of entities from the performance data for the computingenvironment.
 5. The computer-implemented method of claim 1, wherein anentity can include: a virtual machine; a host system that executes oneor more virtual machines; a cluster comprising one or more host systems;and a virtual center comprising one or more clusters.
 6. Thecomputer-implemented method of claim 1, wherein the first performancemetric relates to one or more of: central-processing unit (CPU)utilization; memory utilization; disk utilization; network utilization;and power consumption.
 7. The computer-implemented method of claim 1,wherein the performance metric is measured over a user-specified timeinterval.
 8. A non-transitory computer-readable storage medium storinginstructions that when executed by a computer cause the computer toperform a method for displaying performance data for a computingenvironment, the method comprising: displaying the computing environmentas a tree including nodes representing a plurality of entities thatcomprise the computing environment and edges representing parent-childrelationships between the plurality of entities; and in response to theuser selecting a first node in the tree to be pinned, displaying a firstdetail panel for the first node concurrently with displaying the tree,wherein the first detail panel displays state information for the firstnode that remains unchanged after pinning; in response to the userselecting a second node in the tree to be pinned, displaying a seconddetail panel for the second node concurrently with displaying the tree,wherein the second detail panel displays state information for thesecond node that remains unchanged after pinning; and wherein the firstdetail panel is displayed concurrently with the second detail panel tofacilitate comparing state information between the first and secondnodes.
 9. The non-transitory computer-readable storage medium of claim8, wherein when the first node is a parent node, the state informationfor the first node displayed in the first detail panel includes anaggregated configuration information of one or more descendants of thefirst node; and wherein when the first node is a leaf node, the stateinformation of the first node displayed in the first detail panelincludes a configuration information for the first node.
 10. Thenon-transitory computer-readable storage medium of claim 8, wherein whenthe first node and the second node are the same node, and when the userselects a second performance metric prior to selecting the second nodeto be pinned, displaying the first detail panel involves displayingstate information for the first performance metric; displaying thesecond detail panel involves displaying state information for the secondperformance metric; and wherein the concurrent display of the first andsecond detail panels enables the user to view state for the first andsecond performance metrics for the same node at the same time.
 11. Thenon-transitory computer-readable storage medium of claim 8, whereinprior to displaying the tree, the method further comprises: receiving,from a user, a selection of the first performance metric from a set ofmonitored performance metrics; and obtaining the values for the firstperformance metric for the plurality of entities from the performancedata for the computing environment.
 12. The non-transitorycomputer-readable storage medium of claim 8, wherein an entity caninclude: a virtual machine; a host system that executes one or morevirtual machines; a cluster comprising one or more host systems; and avirtual center comprising one or more clusters.
 13. The non-transitorycomputer-readable storage medium of claim 8, wherein the firstperformance metric relates to one or more of: central-processing unit(CPU) utilization; memory utilization; disk utilization; networkutilization; and power consumption.
 14. The non-transitorycomputer-readable storage medium of claim 8, wherein the performancemetric is measured over a user-specified time interval.
 15. A systemthat displays performance data for a computing environment, the methodcomprising: a computing cluster comprising a plurality of processors andassociated memories; and a performance-monitoring mechanism thatexecutes on the computing cluster, wherein during operation theperformance-monitoring mechanism: displays the computing environment asa tree including nodes representing a plurality of entities thatcomprise the computing environment and edges representing parent-childrelationships between the plurality of entities; and in response to theuser selecting a first node in the tree to be pinned, displays a firstdetail panel for the first node concurrently with displaying the tree,wherein the first detail panel displays state information for the firstnode that remains unchanged after pinning; in response to the userselecting a second node in the tree to be pinned, displays a seconddetail panel for the second node concurrently with displaying the tree,wherein the second detail panel displays state information for thesecond node that remains unchanged after pinning; and wherein the firstdetail panel is displayed concurrently with the second detail panel tofacilitate comparing state information between the first and secondnodes.
 16. The system of claim 15, wherein when the first node is aparent node, the state information for the first node displayed in thefirst detail panel includes an aggregated configuration information ofone or more descendants of the first node; and wherein when the firstnode is a leaf node, the state information of the first node displayedin the first detail panel includes a configuration information for thefirst node.
 17. The system of claim 15, wherein when the first node andthe second node are the same node, and when the user selects a secondperformance metric prior selecting the second node to be pinned: whiledisplaying the first detail panel, the performance-monitoring mechanismdisplays state information for the first performance metric; whiledisplaying the second detail panel, the performance-monitoring mechanismdisplays state information for the second performance metric; andwherein the concurrent display of the first and second detail panelsenables the user to view state for the first and second performancemetrics for the same node at the same time.
 18. The system of claim 15,wherein prior to displaying the tree, the performance-monitoringmechanism: receives, from a user, a selection of the first performancemetric from a set of monitored performance metrics; and obtains thevalues for the first performance metric for the plurality of entitiesfrom the performance data for the computing environment.
 19. The systemof claim 15, wherein an entity can include: a virtual machine; a hostsystem that executes one or more virtual machines; a cluster comprisingone or more host systems; and a virtual center comprising one or moreclusters.
 20. The system of claim 15, wherein the first performancemetric relates to one or more of: central-processing unit (CPU)utilization; memory utilization; disk utilization; network utilization;and power consumption.